Computing an average over space and time
نویسندگان
چکیده
منابع مشابه
Dense scale selection over space, time and space-time
Scale selection methods based on local extrema over scale of scale-normalized derivatives have been primarily developed to be applied sparsely — at image points where the magnitude of a scale-normalized differential expression additionally assumes local extrema over the domain where the data are defined. This paper presents a methodology for performing dense scale selection, so that hypotheses ...
متن کاملStability of an octocoral-algal symbiosis over time and space
In symbiosis, 2 taxonomically different organisms co-exist, each pursuing their own agenda and yet, they are linked in one entity. A mutualistic symbiosis may break up if it is no longer beneficial to either one of the partners. Changing needs over time or changing environmental conditions may prompt symbiont switching. For example, corals may survive elevated temperatures by switching their al...
متن کاملComputing Brain Change over Time
Glossary Diffeomorphism A smooth (technically differentiable) mapping, such as a spatial transformation, that has a smooth inverse. Jacobian (tensor/matrix and determinant) The matrix of all first-order partial derivatives of a mapping, or the determinant thereof, at a given point. The Jacobian determinant encodes the factor by which the mapping expands or shrinks space. Considering every point...
متن کاملConcurrent computing machines and physical space-time
Concrete computing machines, either sequential or concurrent, rely on an intimate relation between computation and time. We recall the general characteristic properties of physical time and of present realizations of computing systems. We emphasize the role of computing interferences, i.e. the necessity to avoid them in order to give a causal implementation to logical operations. We compare syn...
متن کاملDistributed n-player approachability via time and space average consensus
In this paper we consider repeated coalitional games with transferable utilities (TU) over networks. Namely, we consider a set of n players that have to distribute among themselves a vector of rewards (one for each player). In our network version there is no coordinator allocating the rewards, but the agents have to agree on a common time-averaged vector by updating the local estimates of the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2013
ISSN: 1534-7362
DOI: 10.1167/13.9.131